The Crossing Number of P(N, 3)
نویسندگان
چکیده
R. Bruce Richter Department of Mathematics and Statistics, Carleton University, Ottawa, Canada K1S 5B6 and Gelasio Salazar1 School of Mathematics, Georgia Institute of Technology, Atlanta, GA 30319 and IICO{UASLP, San Luis Potosi, Mexico 78000 21 April 1999 Abstract. It is proved that the crossing number of the Generalized Petersen Graph P (3k+ h; 3) is k + h if h 2 f0; 2g and k + 3 if h = 1, for each k 3, with the single exception of P (9; 3), whose crossing number is 2.
منابع مشابه
Study of the Safe Behavior in Road Crossing Using the Theory of Planned Behavior among Middle School Students
Background Given that school-age students, as active road users, are more vulnerable to injury compared with other pedestrians, a large number of them, following an injury, may either fail to go to school at least for a short time or even suffer from disabilities for the rest of their lives. The aim of this study was to determine safe behavior in road crossing using the theory of planned behavi...
متن کاملCircle Orders , N - gon Orders and the Crossing Number of Partial Orders
Let F={P1,...,Pm} be a family of sets. A partial order P(F, <) on F is naturally defined by the condition Pi< Pj iff Pi is contained in Pj. When the elements of F are disks (i.e. circles together with their interiors), P(F, <) is called a circle order; if the elements of F are n-polygons, P(F, <) is called an n-gon order. In this paper we study circle orders and n-gon orders. The crossing numbe...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملMETAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM
This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...
متن کاملEffects of harmalol on scopolamine-induced memory disorders, anxiety and depression like behaviors in male mice: A behavioral and molecular study
Introduction: Harmalol is a dihydrocarboline compound found naturally in several alcoholic beverages and medicinal plants. This study was designed to investigate the effect of harmalol on memory function and its possible mechanisms in a scopolamine-induced memory disorder model. Materials and Methods: Thirty five male mice were randomly divided into five (n=7) group: Control group )normal sali...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 18 شماره
صفحات -
تاریخ انتشار 2002